Towards Argument Mining from Relational DataBase
نویسندگان
چکیده
Argumentation theory is considered an interdisciplinary research area. Its techniques and results have found a wide range of applications in both theoretical and practical branches of artificial intelligence, education, and computer science. Most of the work done in argumentation use the on-line textual data (i.e. unstructured or semi-structured) which is intractable to be processed. This paper reports a novel approach to build a Relational Argument DataBase (RADB) with managing tools for argument mining, the design of the RADB depends on the Argumentation Interchange Format Ontology(AIF) using ”Walton Theory”. The proposed structure aims to: (i) summon and provide a myriad of arguments at the user’s fingertips, (ii) retrieve the most relevant results to the subject of search, (iii) support the fast interaction between the different mining techniques and the existing arguments, and (iv) facilitate the interoperability among various agents/humans.
منابع مشابه
Predator-Miner: Ad hoc Mining of Associations Rules within a Database Management System
In this demonstration, we present a prototype system, Predator-Miner, which extends Predator with an relationallike association rule mining operator to support data mining operations. Predator-Miner allows a user to combine association rule mining queries with SQL queries. This approach towards tight integration differs from existing techniques of using user-defined functions (UDFs), stored pro...
متن کاملTowards Finding Relational Redescriptions
This paper introduces relational redescription mining, that is, the task of finding two structurally different patterns that describe nearly the same set of object tuples in a relational dataset. By extending redescription mining beyond propositional and real-valued attributes, it provides a powerful tool to match different relational descriptions of the same concept. As a first step towards so...
متن کاملOn the Complexity of Mining Association Rules
In this paper we describe our ongoing research towards establishing the complexity of mining association rules from relational databases. We consider both quantitative, categorical and boolean association rules and various forms of quality indexes, including confidence, support, gain, laplace. The presented results show that all these problems are, generally, computationally hard to solve, even...
متن کاملAn efficient approach for effectual mining of relational patterns from multi-relational database
Data mining is an extremely challenging and hopeful research topic due to its well-built application potential and the broad accessibility of the massive quantities of data in databases. Still, the rising significance of data mining in practical real world necessitates ever more complicated solutions while data includes of a huge amount of records which may be stored in various tables of a rela...
متن کاملOntograte: towards Automatic Integration for Relational Databases and the Semantic Web through an Ontology-Based Framework
Integrating existing relational databases with ontology-based systems is among the important research problems for the Semantic Web. We have designed a comprehensive framework called OntoGrate which combines a highly automatic mapping system, a logic inference engine, and several syntax wrappers that inter-operate with consistent semantics to answer ontology-based queries using the data from he...
متن کامل